skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Creators/Authors contains: "Rubinstein, Aviad."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, ACM)
    Full Text Available 
  2. ; ; ; (, ACM)
    Mohar, Bojan; Shinkar, Igor; O'Donnell, Ryan (Ed.)
    We present a constant-factor approximation algorithm for the Nash Social Welfare (NSW) maximization problem with subadditive valuations accessible via demand queries. More generally, we propose a framework for NSW optimization which assumes two subroutines which (1) solve a configuration-type LP under certain additional conditions, and (2) round the fractional solution with respect to utilitarian social welfare. In particular, a constant-factor approximation for submodular valuations with value queries can also be derived from our framework. 
    more » « less
    Accepted Manuscript Full Text Available
  3. ; ; ; (, ACM)
    Mohar, Bojan; Shinkar, Igor; O'Donnell, Ryan (Ed.)
    We present a constant-factor approximation algorithm for the Nash Social Welfare (NSW) maximization problem with subadditive valuations accessible via demand queries. More generally, we propose a framework for NSW optimization which assumes two subroutines that (1) solve a conguration-type LP under certain additional conditions, and (2) round the fractional solution with respect to utilitarian social welfare. In particular, a constant-factor approximation for submodular valuations with value queries can also be derived from our framework. 
    more » « less
    Full Text Available 
  4. ; (, Leibniz international proceedings in informatics)
    Full Text Available 
  5. ; ; ; (, Games and Economic Behavior)
    Full Text Available 
  6. ; (, STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing)
    Full Text Available 
  7. ; ; ; ; (, ACM SIGACT Symposium on Theory of Computing)
    null (Ed.)
    Full Text Available 
  8. ; ; ; ; ; ; ; (, Leibniz international proceedings in informatics)
    Full Text Available 
  9. ; ; ; (, 020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS))
    null (Ed.)
    Full Text Available 
  10. ; ; (, STOC)
    Full Text Available